A Theory of Mediators for Eternal Connectors
نویسندگان
چکیده
On the fly synthesis of mediators is a revolutionary approach to the seamless networking of today’s and future digital systems that increasingly need be connected. The resulting emergent mediators (or Connectors) adapt the interaction protocols run by the connected systems to let them communicate. However, although the mediator concept has been studied and used quite extensively to cope with many heterogeneity dimensions, a remaining key challenge is to support on-the-fly synthesis of mediators. Towards this end, this paper introduces a theory of mediators for the ubiquitous networking environment. The proposed formal model: (i) precisely characterizes the problem of interoperability between networked systems, and (ii) paves the way for automated reasoning about protocol matching (interoperability) and related mediator synthesis.
منابع مشابه
A Formalization of Mediating Connectors: Towards on the fly Interoperability
Mediators stand as a core architectural paradigm for today’s and future systems that increasingly need be connected. The mediator concept has been used to cope with many heterogeneity dimensions spanning: terminology, representation format, transfer protocols, functionality, and application-layer protocols. Still, a key challenge for today’s systems architectures is to embed the necessary suppo...
متن کاملA Theory of Mediating Connectors to achieve Interoperability
Systems populating the Ubiquitous Computing environment are characterized by an often extreme level of heterogeneity at different layers which prevents their seamless interoperability. In this environment, heterogeneous protocols would cooperate to reach some common goal even though they meet dynamically and do not have a priori knowledge of each other. Although numerous efforts have been done ...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملDomination, eternal domination and clique covering
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-eternal domination model. Inequality chains consisting of the domination, eternal domination, m-eternal domination, independence, and clique c...
متن کاملApplication-Layer Connector Synthesis
The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to cooperate in order to reach some common goal even though they meet dynamically and do not have a priori knowledge of each other. Despite numerous efforts have been done in the literature, the automated and run-time inter...
متن کامل